0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM
0.12/0.33	% Computer : n010.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1920
0.12/0.33	% WCLimit    : 240
0.12/0.33	% DateTime   : Wed Jul 30 02:55:04 EDT 2025
0.12/0.34	% CPUTime    : 
0.20/0.48	Running higher-order theorem proving
0.20/0.49	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.68TL0czPJn/E---3.1_10356.p
0.20/0.51	# Version: 3.0.0-ho
0.20/0.51	# Preprocessing class: HSSSSMSSMLSNHSN.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.51	# Starting new_ho_9 with 1200s (5) cores
0.20/0.51	# Starting post_as_ho1 with 240s (1) cores
0.20/0.51	# Starting sh1l with 240s (1) cores
0.20/0.51	# Starting post_as_ho10 with 240s (1) cores
0.20/0.51	# sh1l with pid 10436 completed with status 0
0.20/0.51	# Result found by sh1l
0.20/0.51	# Preprocessing class: HSSSSMSSMLSNHSN.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.51	# Starting new_ho_9 with 1200s (5) cores
0.20/0.51	# Starting post_as_ho1 with 240s (1) cores
0.20/0.51	# Starting sh1l with 240s (1) cores
0.20/0.51	# No SInE strategy applied
0.20/0.51	# Search class: HGHSF-FFSF00-SHSSMFNN
0.20/0.51	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.20/0.51	# Starting new_ho_10 with 130s (1) cores
0.20/0.51	# new_ho_10 with pid 10440 completed with status 0
0.20/0.51	# Result found by new_ho_10
0.20/0.51	# Preprocessing class: HSSSSMSSMLSNHSN.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.51	# Starting new_ho_9 with 1200s (5) cores
0.20/0.51	# Starting post_as_ho1 with 240s (1) cores
0.20/0.51	# Starting sh1l with 240s (1) cores
0.20/0.51	# No SInE strategy applied
0.20/0.51	# Search class: HGHSF-FFSF00-SHSSMFNN
0.20/0.51	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.20/0.51	# Starting new_ho_10 with 130s (1) cores
0.20/0.51	# Preprocessing time       : 0.001 s
0.20/0.51	# Presaturation interreduction done
0.20/0.51	
0.20/0.51	# Proof found!
0.20/0.51	# SZS status Theorem
0.20/0.51	# SZS output start CNFRefutation
0.20/0.51	thf(decl_30, type, rc: ($i > $i > $o) > $i > $i > $o).
0.20/0.51	thf(decl_34, type, sc: ($i > $i > $o) > $i > $i > $o).
0.20/0.51	thf(decl_52, type, epred1_0: $i > $i > $o).
0.20/0.51	thf(decl_53, type, esk1_0: $i).
0.20/0.51	thf(decl_54, type, esk2_0: $i).
0.20/0.51	thf(reflexive_closure, axiom, ((rc)=(^[X1:$i > $i > $o, X3:$i, X4:$i]:((((X3)=(X4))|(X1 @ X3 @ X4))))), file('/export/starexec/sandbox2/tmp/tmp.68TL0czPJn/E---3.1_10356.p', reflexive_closure)).
0.20/0.51	thf(symmetric_closure, axiom, ((sc)=(^[X1:$i > $i > $o, X3:$i, X4:$i]:(((X1 @ X4 @ X3)|(X1 @ X3 @ X4))))), file('/export/starexec/sandbox2/tmp/tmp.68TL0czPJn/E---3.1_10356.p', symmetric_closure)).
0.20/0.51	thf(composing_symmetric_closure_and_reflexive_closure, conjecture, ![X1:$i > $i > $o]:(((sc @ (rc @ X1))=(rc @ (sc @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.68TL0czPJn/E---3.1_10356.p', composing_symmetric_closure_and_reflexive_closure)).
0.20/0.51	thf(c_0_3, plain, ((rc)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i, Z2:$i]:((((Z1)=(Z2))|(Z0 @ Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[reflexive_closure])).
0.20/0.51	thf(c_0_4, plain, ((sc)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i, Z2:$i]:(((Z0 @ Z2 @ Z1)|(Z0 @ Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[symmetric_closure])).
0.20/0.51	thf(c_0_5, negated_conjecture, ~(![X1:$i > $i > $o, X158:$i, X159:$i]:(((((X159)=(X158))|(X1 @ X159 @ X158)|(((X158)=(X159))|(X1 @ X158 @ X159)))<=>(((X158)=(X159))|((X1 @ X159 @ X158)|(X1 @ X158 @ X159)))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[composing_symmetric_closure_and_reflexive_closure]), c_0_3]), c_0_4])])).
0.20/0.51	thf(c_0_6, negated_conjecture, (((((((esk1_0)!=(esk2_0))|((esk2_0)!=(esk1_0)))&((~(epred1_0 @ esk2_0 @ esk1_0)|((esk2_0)!=(esk1_0)))&(~(epred1_0 @ esk1_0 @ esk2_0)|((esk2_0)!=(esk1_0)))))&((((esk1_0)!=(esk2_0))|~(epred1_0 @ esk2_0 @ esk1_0))&((~(epred1_0 @ esk2_0 @ esk1_0)|~(epred1_0 @ esk2_0 @ esk1_0))&(~(epred1_0 @ esk1_0 @ esk2_0)|~(epred1_0 @ esk2_0 @ esk1_0)))))&(((((esk1_0)!=(esk2_0))|((esk1_0)!=(esk2_0)))&((~(epred1_0 @ esk2_0 @ esk1_0)|((esk1_0)!=(esk2_0)))&(~(epred1_0 @ esk1_0 @ esk2_0)|((esk1_0)!=(esk2_0)))))&((((esk1_0)!=(esk2_0))|~(epred1_0 @ esk1_0 @ esk2_0))&((~(epred1_0 @ esk2_0 @ esk1_0)|~(epred1_0 @ esk1_0 @ esk2_0))&(~(epred1_0 @ esk1_0 @ esk2_0)|~(epred1_0 @ esk1_0 @ esk2_0))))))&(((esk2_0)=(esk1_0))|(epred1_0 @ esk2_0 @ esk1_0)|(((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0))|(((esk1_0)=(esk2_0))|((epred1_0 @ esk2_0 @ esk1_0)|(epred1_0 @ esk1_0 @ esk2_0))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])).
0.20/0.51	thf(c_0_7, negated_conjecture, (((esk2_0)=(esk1_0))|(epred1_0 @ esk2_0 @ esk1_0)|((esk1_0)=(esk2_0))|(epred1_0 @ esk1_0 @ esk2_0)|((esk1_0)=(esk2_0))|(epred1_0 @ esk2_0 @ esk1_0)|(epred1_0 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.20/0.51	thf(c_0_8, negated_conjecture, (((esk1_0)!=(esk2_0))|((esk1_0)!=(esk2_0))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.20/0.51	thf(c_0_9, negated_conjecture, (~((epred1_0 @ esk1_0 @ esk2_0))|~((epred1_0 @ esk1_0 @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.20/0.51	thf(c_0_10, negated_conjecture, (~((epred1_0 @ esk2_0 @ esk1_0))|~((epred1_0 @ esk2_0 @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.20/0.51	thf(c_0_11, negated_conjecture, (((esk2_0)=(esk1_0))|(epred1_0 @ esk1_0 @ esk2_0)|(epred1_0 @ esk2_0 @ esk1_0)), inference(cn,[status(thm)],[c_0_7])).
0.20/0.51	thf(c_0_12, negated_conjecture, ((esk2_0)!=(esk1_0)), inference(cn,[status(thm)],[c_0_8])).
0.20/0.51	thf(c_0_13, negated_conjecture, ~((epred1_0 @ esk1_0 @ esk2_0)), inference(cn,[status(thm)],[c_0_9])).
0.20/0.51	thf(c_0_14, negated_conjecture, ~((epred1_0 @ esk2_0 @ esk1_0)), inference(cn,[status(thm)],[c_0_10])).
0.20/0.51	thf(c_0_15, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_11, c_0_12]), c_0_13]), c_0_14]), ['proof']).
0.20/0.51	# SZS output end CNFRefutation
0.20/0.51	# Parsed axioms                        : 59
0.20/0.51	# Removed by relevancy pruning/SinE    : 0
0.20/0.51	# Initial clauses                      : 42
0.20/0.51	# Removed in clause preprocessing      : 29
0.20/0.51	# Initial clauses in saturation        : 13
0.20/0.51	# Processed clauses                    : 10
0.20/0.51	# ...of these trivial                  : 0
0.20/0.51	# ...subsumed                          : 6
0.20/0.51	# ...remaining for further processing  : 3
0.20/0.51	# Other redundant clauses eliminated   : 0
0.20/0.51	# Clauses deleted for lack of memory   : 0
0.20/0.51	# Backward-subsumed                    : 0
0.20/0.51	# Backward-rewritten                   : 0
0.20/0.51	# Generated clauses                    : 0
0.20/0.51	# ...of the previous two non-redundant : 0
0.20/0.51	# ...aggressively subsumed             : 0
0.20/0.51	# Contextual simplify-reflections      : 0
0.20/0.51	# Paramodulations                      : 0
0.20/0.51	# Factorizations                       : 0
0.20/0.51	# NegExts                              : 0
0.20/0.51	# Equation resolutions                 : 0
0.20/0.51	# Disequality decompositions           : 0
0.20/0.51	# Total rewrite steps                  : 0
0.20/0.51	# ...of those cached                   : 0
0.20/0.51	# Propositional unsat checks           : 0
0.20/0.51	#    Propositional check models        : 0
0.20/0.51	#    Propositional check unsatisfiable : 0
0.20/0.51	#    Propositional clauses             : 0
0.20/0.51	#    Propositional clauses after purity: 0
0.20/0.51	#    Propositional unsat core size     : 0
0.20/0.51	#    Propositional preprocessing time  : 0.000
0.20/0.51	#    Propositional encoding time       : 0.000
0.20/0.51	#    Propositional solver time         : 0.000
0.20/0.51	#    Success case prop preproc time    : 0.000
0.20/0.51	#    Success case prop encoding time   : 0.000
0.20/0.51	#    Success case prop solver time     : 0.000
0.20/0.51	# Current number of processed clauses  : 3
0.20/0.51	#    Positive orientable unit clauses  : 0
0.20/0.51	#    Positive unorientable unit clauses: 0
0.20/0.51	#    Negative unit clauses             : 3
0.20/0.51	#    Non-unit-clauses                  : 0
0.20/0.51	# Current number of unprocessed clauses: 3
0.20/0.51	# ...number of literals in the above   : 6
0.20/0.51	# Current number of archived formulas  : 0
0.20/0.51	# Current number of archived clauses   : 0
0.20/0.51	# Clause-clause subsumption calls (NU) : 0
0.20/0.51	# Rec. Clause-clause subsumption calls : 0
0.20/0.51	# Non-unit clause-clause subsumptions  : 0
0.20/0.51	# Unit Clause-clause subsumption calls : 1
0.20/0.51	# Rewrite failures with RHS unbound    : 0
0.20/0.51	# BW rewrite match attempts            : 0
0.20/0.51	# BW rewrite match successes           : 0
0.20/0.51	# Condensation attempts                : 10
0.20/0.51	# Condensation successes               : 0
0.20/0.51	# Termbank termtop insertions          : 3274
0.20/0.51	# Search garbage collected termcells   : 741
0.20/0.51	
0.20/0.51	# -------------------------------------------------
0.20/0.51	# User time                : 0.006 s
0.20/0.51	# System time              : 0.001 s
0.20/0.51	# Total time               : 0.007 s
0.20/0.51	# Maximum resident set size: 2164 pages
0.20/0.51	
0.20/0.51	# -------------------------------------------------
0.20/0.51	# User time                : 0.008 s
0.20/0.51	# System time              : 0.003 s
0.20/0.51	# Total time               : 0.012 s
0.20/0.51	# Maximum resident set size: 1780 pages
0.20/0.51	% E exiting
0.20/0.51	% E exiting
0.20/0.51	EOF